On the Characterization of Least Upper Bound Norms in Matrix Space
نویسنده
چکیده
of the origin in C ' , and vice versa. But clearly, not every convex compact neighbourhood of the origin in C ~' belongs to a lub norm. The principal problem to be considered here is the geometric characterizat ion of those convex bodies in C ~' which are associated with lub norms. The question arises because of the fact tha t m a n y of the properties of vector norms fall quite easily and natura l ly out of a consideration of the associated convex bodies, and it is hoped tha t these results will th row some light on the ra ther more difficult questions related with multiplicative mat r ix norms and lub norms.
منابع مشابه
Task-space Control of Electrically Driven Robots
Actuators of robot operate in the joint-space while the end-effect or of robot is controlled in the task-space. Therefore, designing a control system for a robotic system in the task-space requires the jacobian matrix information for transforming joint-space to task-space, which suffers from uncertainties. This paper deals with the robust task-space control of electrically driven robot manipula...
متن کاملA CHARACTERIZATION OF BAER-IDEALS
An ideal I of a ring R is called right Baer-ideal if there exists an idempotent e 2 R such that r(I) = eR. We know that R is quasi-Baer if every ideal of R is a right Baer-ideal, R is n-generalized right quasi-Baer if for each I E R the ideal In is right Baer-ideal, and R is right principaly quasi-Baer if every principal right ideal of R is a right Baer-ideal. Therefore the concept of Baer idea...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کامل